-
1 coprime order
Большой англо-русский и русско-английский словарь > coprime order
-
2 coprime order
Математика: взаимно простой порядок -
3 coprime order
-
4 coprime
матем. взаимно простой coprime in the large functions ≈ взаимно простые в целом функции coprime moduli modulus ≈ взаимно простые модули - coprime continuations - coprime elements - coprime functions - coprime ideals - coprime integers - coprime numbers - coprime order - coprime polynomial -
5 order
1) заказ || заказывать2) наряд3) ордер4) приказ; распоряжение || приказывать; распоряжаться5) кратность6) очерёдность7) порядок || порядковый9) расстановка; расположение || располагать по порядку10) упорядоченность || упорядочивать11) вчт команда12) разряд числа•in a working order — в порядке, годный к работе
in order that [in order to] — для того чтобы
in the n-th order — мат. с точностью до членов n-го порядка
in the order of decreasing — мат. в порядке убывания
in the order of increasing — мат. в порядке возрастания
to arrange in the order of magnitude — располагать в порядке возрастания, располагать по возрастанию
to make to the order — делать на заказ; изготовлять по заказу
-
6 coprimes
матем. -
7 взаимно простой порядок
Большой англо-русский и русско-английский словарь > взаимно простой порядок
-
8 element
1) элемент, компонент, деталь, составная часть2) звено; блок; модуль3) устройство, узел4) орган5) датчик, первичный элемент6) элемент, параметр•
См. также в других словарях:
Order (group theory) — This article is about order in group theory. For order in other branches of mathematics, see Order (mathematics). For order in other disciplines, see Order. In group theory, a branch of mathematics, the term order is used in two closely related… … Wikipedia
Order (number theory) — In number theory, the order of an element a pmod{n} is the smallest integer k such that a^k equiv 1pmod{n}. Note that the order is only defined when gcd(a,n) = 1, i.e. a and n are coprimes.By Euler s theorem, the order (mod n) must divide phi(n) … Wikipedia
Multiplicative order — In number theory, given an integer a and a positive integer n with gcd(a,n) = 1, the multiplicative order of a modulo n is the smallest positive integer k with ak ≡ 1 (mod n). The order of a modulo n is usually written ordn(a), or On(a). Contents … Wikipedia
Abelian group — For other uses, see Abelian (disambiguation). Abelian group is also an archaic name for the symplectic group Concepts in group theory category of groups subgroups, normal subgroups group homomorphisms, kernel, image, quotient direct product,… … Wikipedia
Central series — In mathematics, especially in the fields of group theory and Lie theory, a central series is a kind of normal series of subgroups or Lie subalgebras, expressing the idea that the commutator is nearly trivial. For groups, this is an explicit… … Wikipedia
Transposable integer — A summary of this article appears in Repeating decimal. The digits of some specific integers permute or shift cyclically when they are multiplied by a number n. Examples are: 142857 × 3 = 428571 (shifts cyclically one place left) 142857 × 5 =… … Wikipedia
Modular representation theory — is a branch of mathematics, and that part of representation theory that studies linear representations of finite group G over a field K of positive characteristic. As well as having applications to group theory, modular representations arise… … Wikipedia
Euler's totient function — For other functions named after Euler, see List of topics named after Leonhard Euler. The first thousand values of φ(n) In number theory, the totient φ(n) of a positive integer n is defined to be the number of positive integers less than or equal … Wikipedia
Prime number — Prime redirects here. For other uses, see Prime (disambiguation). A prime number (or a prime) is a natural number greater than 1 that has no positive divisors other than 1 and itself. A natural number greater than 1 that is not a prime number is… … Wikipedia
Primitive root modulo n — In modular arithmetic, a branch of number theory, a primitive root modulo n is any number g with the property that any number coprime to n is congruent to a power of g (mod n ). That is, if g is a primitive root (mod n ) and gcd( a , n ) = 1,… … Wikipedia
Arithmetic function — In number theory, an arithmetic (or arithmetical) function is a real or complex valued function ƒ(n) defined on the set of natural numbers (i.e. positive integers) that expresses some arithmetical property of n. [1] An example of an arithmetic… … Wikipedia